A New-come Book Recommendation Algorithm Based on Features in University’s Library

نویسندگان

  • Yue Qi
  • Wenwen Chen
  • Huan Zhou
چکیده

The university’s libraries have always had too many resources to be found by readers so the value of many books has been reduced for missing prescription. Although there have already been a lot of book recommendation researches in university library, few studies have been carried out in respect of the fact how to recommend the new-come books. New books should be more valuable to be recommended, but often overlooked by readers in the recommendation systems because of low weight. To solve this problem, a new-come book recommendation algorithm has been presented to help readers find their interested new books in time and improve all the new books’ value in use. Through extracting the feature of new books and analyzing readers’ borrowing behavior, effort have been devoted to get the readers’ borrowing interest and the popular books recently, and calculate the similarity between books and readers through feature extraction so as to find out the new books which maybe popular and recommend them to all readers timely, and find right readers for other new books. With experiments carried out by using historical data of Southwest University Library, to some extent, it shows that the algorithm can find the new-come books which comply with the popular feature or may be interested by some readers, then get the personalized recommendation result effectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Active Recommendation Approach to Improve Book-Acquisition Process

In the current book-acquisition recommendation process of libraries (e.g, university’s library), only a part of borrowers actively recommends purchasing books and the book recommendation mostly needs to be processed artificially; thus, most borrowers’ requirements can not be satisfied and the book acquisition efficiency is unsound. Therefore, this paper attempts to develop a book-acquisition re...

متن کامل

A New Similarity Measure Based on Item Proximity and Closeness for Collaborative Filtering Recommendation

Recommender systems utilize information retrieval and machine learning techniques for filtering information and can predict whether a user would like an unseen item. User similarity measurement plays an important role in collaborative filtering based recommender systems. In order to improve accuracy of traditional user based collaborative filtering techniques under new user cold-start problem a...

متن کامل

Personalized Book Recommendation Based on Ontology and Collaborative Filtering Algorithm

Information recommendation service is one of important functions of digital library, aiming at the problem that book recommendation service exists the insufficient requirement mining of service object information in the current university library, personalized book recommendation method based on ontology information and collaborative filtering algorithm (abbreviated as OI-CFA algorithm) is prop...

متن کامل

The Research on Personalized Recommendation Algorithm of Library Based on Big Data and Association Rules

In order to provide better information consistent with their preferences features for users, personalized recommendation technology has become an important research field of digital libraries and get more and more attention from searchers. Among them, the large data mining and association rules-based personalized recommendation technology is the focus of research in the field of recommendation....

متن کامل

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015